Weak - nets have basis of size O ( 1 / log ( 1 / ) ) in any dimension
نویسندگان
چکیده
Given a set P of n points in Rd and > 0, we consider the problem of constructing weak -nets for P . We show the following: pick a random sample Q of size O(1/ log (1/ )) from P . Then, with constant probability, a weak -net of P can be constructed from only the points of Q. This shows that weak -nets in Rd can be computed from a subset of P of size O(1/ log(1/ )) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ . However, our final weak -nets still have a large size (with the dimension appearing in the exponent of 1/ ). © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane
Let B be any set of n axis-aligned boxes in R, d ≥ 1. We call a subset N ⊆ B a (1/c)-net for B if any p ∈ R contained in more than n/c boxes of B must be contained in a box of N , or equivalently if a point not contained in any box in N can only stab at most n/c boxes of B. General VC-dimension theory guarantees the existence of (1/c)-nets of size O(c log c) for any fixed d, the constant in the...
متن کاملA Note about Weak ε-nets for Axis-Parallel Boxes in d-space
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axisparallel boxes in R, for d ≥ 4. Our analysis uses a non-trivial variant of the recent technique of Aronov et al. [2] that yields (strong) ε-nets, whose size have the above asymptotic bound, for d = 2, 3.
متن کاملWeak ε-nets for Axis-Parallel Boxes in d-Space
In this note we show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axis-parallel boxes in R. Our analysis uses a non-trivial variant for the recent technique of Aronov et al. [AES09] that yields (strong) ε-nets, whose size have the above asymptotic bound, for d = 2, 3. Work on this paper has been supported by NSF under grants CNS-05-40347, CFF-06-35000, and DEB-0...
متن کاملNew Existence Proofs for 2-Nets
We describe a new technique for proving the existence of small 2-nets for hypergraphs satisfying certain simple conditions. The technique is particularly useful for proving o( 1 2 log 1 2 ) upper bounds which is not possible using the standard VC dimension theory. We apply the technique to several geometric hypergraphs and obtain simple proofs for the existence of O( 1 2 ) size 2-nets for them....
متن کاملHow to Net a Lot with Little : Small " - Nets for
It is known that in general range spaces of VC-dimension d > 1 require "-nets to be of size at least (d " log 1 "). We address the question whether this general lower bound is valid for the special range spaces that typically arise in computational geometry. We show that disks and pseudo-disks in the plane as well as halfspaces in R 3 allow "-nets of size only O(1 "), which is best possible up ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007